Minimizing the Number of Carries in Addition
نویسنده
چکیده
When numbers are added in base b in the usual way, carries occur. If two random, independent 1-digit numbers are added, then the probability of a carry is b−1 2b . Other choices of digits lead to less carries. In particular, if for odd b we use the digits {−(b− 1)/2,−(b− 3)/2, . . . , . . . (b− 1)/2} then the probability of carry is only b −1 4b2 . Diaconis, Shao and Soundararajan conjectured that this is the best choice of digits, and proved that this is asymptotically the case when b = p is a large prime. In this note we prove this conjecture for all odd primes p. 1 The problem and result When numbers are added in base b in the usual way, carries occur. If two added one-digit numbers are random and independent, then the probability of a carry is b−1 2b . Other choices of digits lead to less carries. In particular, if for odd b we use balanced digits, that is, the digits {−(b− 1)/2,−(b− 3)/2, . . . , 0, 1, 2, . . . (b− 1)/2} then the probability of carry is only b 2−1 4b2 . Diaconis, Shao and Soundararajan [4] conjectured that this is the best choice of digits, and proved that this conjecture is asymptotically correct when b = p is a large prime. More precisely, they proved the following. Theorem 1.1 ([4]) For every > 0 there exists a number p0 = p0( ) so that for any prime p > p0 the probability of carry when adding two random independent one-digit numbers using any fixed set of digits in base p is at least 14 − . The estimate given in [4] to p0 = p0( ) is a tower function of 1/ . Here we establish a tight result for any prime p, proving the conjecture for any prime. Theorem 1.2 For any odd prime p, the probability of carry when adding two random independent one-digit numbers using any fixed set of digits in base p is at least p 2−1 4p2 . ∗Sackler School of Mathematics and Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel. Email: [email protected]. Research supported in part by an ERC Advanced grant, by a USA-Israeli BSF grant and by the Israeli I-Core program.
منابع مشابه
An algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis
This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملEvolutionary Approach for Energy Minimizing Vehicle Routing Problem with Time Windows and Customers’ Priority
A new model and solution for the energy minimizing vehicle routing problem with time windows (EVRPTW) and customers’ priority is presented in this paper. In this paper unlike prior attempts to minimize cost by minimizing overall traveling distance, the model also incorporates energy minimizing which meets the latest requirements of green logistics. This paper includes the vehicles load as an ad...
متن کاملMinimizing the number of tool switches in flexible manufacturing cells subject to tools reliability using genetic algorithm
Nowadays, flexible manufacturing systems play an effective role in a variety of production and timely response to the needs of their customers. Flexible manufacturing cell is a part of this system that includes machines with flexibility in manufacturing different parts. For many years, minimizing the number of tool switches in the machines has been studied by the researchers. Most research in t...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملOptimization of Finned-Tube Heat Exchanger with Minimizing the Entropy Production rate
A compact fin-tube heat exchanger is used to transfer current fluid heat inside the tubes into the air outside. In this study, entropy production and optimized Reynolds number for finned-tube heat exchangers based on the minimum entropy production have been investigated. As a result, the total entropy of compact heat exchangers, which is the summation of the production rate of fluid entropy ins...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 27 شماره
صفحات -
تاریخ انتشار 2013